Many-server scaling of the N-system under FCFS-ALIS
نویسندگان
چکیده
The N-System with independent Poisson arrivals and exponential server-dependent service times under first come first served and assign to longest idle server policy has explicit steady state distribution. We scale the arrival and the number of servers simultaneously, and obtain the fluid and central limit approximation for the steady state. This is the first step towards exploring the many server scaling limit behavior of general parallel service systems.
منابع مشابه
Design Heuristic for Parallel Many Server Systems under FCFS-ALIS
We study a parallel service queueing system with servers of types s1, . . . , sJ , customers of types c1, . . . , cI , bipartite compatibility graph G, where arc (ci, sj) indicates that server type sj can serve customer type ci, and service policy of first come first served FCFS, assign longest idle server ALIS. For a general renewal stream of arriving customers and general service time distrib...
متن کاملBounding Delays in Packet-Routing Networks with Light Tra c
IfN is a queueing network and cs is the mean service time at server s of N , de ne NC,FCFS (respectively, NE,FCFS) to be the queueing network N where the service time at server s is a constant cs (respectively, an independent exponentially distributed random variable with mean cs) and the packets are served in a rst-comerst-served order. Recently, Harchol-Balter and Wolfe introduced the problem...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملA single server perishable inventory system with N additional options for service
This article presents a perishable (s; S) inventory system under continuous review at a service facility in which a waiting hall for customers is of nite size M. The arrival instants of customers to the service station constitutes a Poisson process. The life time of each items is assumed to be exponential. All arriving customers demand the rst "essential" service, whereas only some of them dema...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 88 شماره
صفحات -
تاریخ انتشار 2018